Normal equivalent to an arbitrary diagonalizable matrix
نویسندگان
چکیده
منابع مشابه
Involutiveness of linear combinations of a quadratic or tripotent matrix and an arbitrary matrix
In this article, we characterize the involutiveness of the linear combination of the forma1A1 +a2A2 when a1, a2 are nonzero complex numbers, A1 is a quadratic or tripotent matrix,and A2 is arbitrary, under certain properties imposed on A1 and A2.
متن کاملMechanical material characterization of an embedded Carbon nanotube in polymer matrix by employing an equivalent fiber
Effective elastic properties for carbon nanotube reinforced composites are obtained through a variety of micromechanics techniques. An embedded carbon nanotube in a polymer matrix and its surrounding interphase is replaced with an equivalent fiber for predicting the mechanical properties of the carbon nanotube/polymer composite. The effects of an interphase layer between the nan...
متن کاملMechanical material characterization of an embedded Carbon nanotube in polymer matrix by employing an equivalent fiber
Effective elastic properties for carbon nanotube reinforced composites are obtained through a variety of micromechanics techniques. An embedded carbon nanotube in a polymer matrix and its surrounding interphase is replaced with an equivalent fiber for predicting the mechanical properties of the carbon nanotube/polymer composite. The effects of an interphase layer between the nan...
متن کاملSmall submodules with respect to an arbitrary submodule
Let $R$ be an arbitrary ring and $T$ be a submodule of an $R$-module $M$. A submodule $N$ of $M$ is called $T$-small in $M$ provided for each submodule $X$ of $M$, $Tsubseteq X+N$ implies that $Tsubseteq X$. We study this mentioned notion which is a generalization of the small submodules and we obtain some related results.
متن کاملFast Polar Decomposition of an Arbitrary Matrix
The polar decomposition of an m x n matrix A of full rank, where rn n, can be computed using a quadratically convergent algorithm of Higham SIAMJ. Sci. Statist. Comput., 7 (1986), pp. 1160-1174]. The algorithm is based on a Newton iteration involving a matrix inverse. It is shown how, with the use of a preliminary complete orthogonal decomposition, the algorithm can be extended to arbitrary A. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1983
ISSN: 0024-3795
DOI: 10.1016/0024-3795(83)90156-8